Modal Resolution

Destructive Modal Resolution

We present non-clausal resolution systems for propositional modal logics whose Kripke models do not involve symmetry, and for first order versions whose Kripke models do not involve constant domains. We give systems for K, T , K4 and S4; other logics are also possible. Our systems do not require preliminary reduction to a normal form and, in the first order case, intermingle resolution steps wi...

High-resolution modal analysis

Usual modal analysis techniques are based on the Fourier transform. Due to the ∆T.∆f limitation, they perform poorly when the modal overlap μ exceeds 30%. A technique based on a high-resolution analysis algorithm and an order-detection method is presented here, with the aim of filling the gap between the lowand the high-frequency domains (30% < μ < 100%). A pseudo-impulse force is applied at po...

Developing Modal Tableaux and Resolution Methods via First-Order Resolution

Prefixed Resolution: A Resolution Method for Modal and Description Logics

We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important ways. First, it avoids translations into large undecidable logics, and works directly on modal or description logic formulas instead. Second, by using labeled formulas it avoids the complexities of earlier propositional resolution-based methods for modal lo...

Resolution-Based Methods for Modal Logics

In this paper we give an overview of resolution methods for extended propositional modal logics. We adopt the standard translation approach and consider different resolution refinements which provide decision procedures for the resulting clause sets. Our procedures are based on ordered resolution and selection-based resolution. The logics that we cover are multi-modal logics defined over relati...